Parallel computation on interval graphs: algorithms and experiments
نویسندگان
چکیده
منابع مشابه
Parallel computation on interval graphs: algorithms and experiments
This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for connected components, maximum weighted clique, and breadth-first-search and depth-first-search trees, as well as O(log p) communication rounds algorithms for optimization problems such a...
متن کاملParallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments
The use of PC clusters interconnected by high performance local networks is one of the major current trends in parallel/distributed computing. These clusters can yield effective parallel systems for a fraction of the price of machines using special purpose hardware. Although significant effort has been undertaken on system-level and programming environment issues for such clusters, much less at...
متن کاملSome Optimal Parallel Algorithms on Interval and Circular-arc Graphs
In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our preprocessing algorithms run in O(log n) t...
متن کاملBroadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees
Broadcast domination assigns an integer value f(u) 0 to each vertex u of a given graph, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. We can regard the vertices v with f(v) > 0 as broadcast stations, each having a transmission power that might be di erent from the powers of other stations. The optimal broadcast domination problem seeks to minimize...
متن کاملParallel Algorithms for Connected Domination Problem on Interval and Circular-arc Graphs
A connected domination set of a graph is a set of vertices such that every vertex not in is adjacent to and the induced subgraph of is connected. The minimum connected domination set of a graph is the connected domination set with the minimum number of vertices. In this paper, we propose parallel algorithms for finding the minimum connected domination set of interval graphs and circular-arc gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Concurrency and Computation: Practice and Experience
سال: 2002
ISSN: 1532-0626
DOI: 10.1002/cpe.700